Image Encryption Using Fibonacci-Lucas Transformation
نویسندگان
چکیده
Secret communication techniques are of great demand since last 3000 years due to the need of information security and confidentiality at various levels of communication such as while communicating confidential personal data , patients’ medical data, countries’ defence and intelligence information, data related to examinations etc. With advancements in image processing research, Image encryption and Steganographic techniques have gained popularity over other forms of hidden communication techniques during the last few decades and a number of image encryption models are suggested by various researchers from time to time. In this paper, we are suggesting a new image encryption model based on Fibonacci and Lucas series.
منابع مشابه
Two Fibonacci P-code based image scrambling algorithms
Image scrambling is used to make images visually unrecognizable such that unauthorized users have difficulty decoding the scrambled image to access the original image. This article presents two new image scrambling algorithms based on Fibonacci p-code, a parametric sequence. The first algorithm works in spatial domain and the second in frequency domain (including JPEG domain). A parameter, p, i...
متن کاملRelationship between Fibonacci and Lucas sequences and their application in Symmetric Cryptosystems
Abstract— Identification whether a certain number belongs to either Fibonacci or Lucas sequence is computationally intense task in the sense that the sequence itself need to be written from the beginning until the requested number. In this paper we present a method of detecting whether a certain number is of Lucas or Fibonacci sequence as well as introduce relationships between such sequences. ...
متن کاملExact Determinants of the RFPrLrR Circulant Involving Jacobsthal, Jacobsthal-Lucas, Perrin and Padovan Numbers
Circulant matrix family occurs in various fields, applied in image processing, communications, signal processing, encoding and preconditioner. Meanwhile, the circulant matrices [1, 2] have been extended in many directions recently. The f(x)-circulant matrix is another natural extension of the research category, please refer to [3, 11]. Recently, some authors researched the circulant type matric...
متن کاملData Encryption and Decryption Using ANZL Algorithm
What is the ANZL Algorithm? It is a genuine result of our work which is theoretically and practically proved. By using the ANZL Algorithm, we can test whether a given number belongs to Lucas’s series. It can also be used to find a sequence of Lucas’s numbers, starting from any number . If a given number completes the relation , we can say that it is a Lucas number and we mark it as . From the p...
متن کاملNovel Encryption Schemes Based on Catalan Numbers
Applied Number theory has so many applications in cryptography. Particularly integer sequences play very important in cryptography. Earlier cryptographic algorithms were designed using the integer sequences of Fibonacci numbers and Lucas numbers. In the present paper novel cryptographic algorithms were proposed basing on integer sequences of Catalan numbers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1210.5912 شماره
صفحات -
تاریخ انتشار 2012